Joint large deviation result for empirical measures of the coloured random geometric graphs
نویسنده
چکیده
We prove joint large deviation principle for the empirical pair measure and empirical locality measure of the near intermediate coloured random geometric graph models on n points picked uniformly in a d-dimensional torus of a unit circumference. From this result we obtain large deviation principles for the number of edges per vertex, the degree distribution and the proportion of isolated vertices for the near intermediate random geometric graph models.
منابع مشابه
Lossy Asymptotic Equipartition Property For Geometric Networked Data Structures
Abstract. This article extends the Generalized Asypmtotic Equipartition Property of Networked Data Structures to cover the Wireless Sensor Network modelled as coloured geometric random graph (CGRG). The main techniques used to prove this result remains large deviation principles for properly defined empirical measures on coloured geometric random graphs. Application of the result to some case s...
متن کاملLarge Deviation Principles for Empirical Measures of Coloured Random Graphs
Abstract. For any finite coloured graph we define the empirical neighbourhood measure, which counts the number of vertices of a given colour connected to a given number of vertices of each colour, and the empirical pair measure, which counts the number of edges connecting each pair of colours. For a class of models of sparse coloured random graphs, we prove large deviation principles for these ...
متن کاملJoint Large Deviation principle for empirical measures of the d-regular random graphs
For a $d-$regular random model, we assign to vertices $q-$state spins. From this model, we define the \emph{empirical co-operate measure}, which enumerates the number of co-operation between a given couple of spins, and \emph{ empirical spin measure}, which enumerates the number of sites having a given spin on the $d-$regular random graph model. For these empirical measures we obtain large devi...
متن کاملAsymptotic Equipartition Properties for simple hierarchical and networked structures
Abstract. We prove asymptotic equipartition properties for simple hierarchical structures (modelled as multitype Galton-Watson trees) and networked structures (modelled as randomly coloured random graphs). For example, for large n, a networked data structure consisting of n units connected by an average number of links of order n/ log n can be coded by about H × n bits, where H is an explicitly...
متن کاملLocal Large deviation: A McMillian Theorem for Coloured Random Graph Processes
Abstract. For a finite typed graph on n nodes and with type law μ, we define the socalled spectral potential ρλ( ·, μ), of the graph.From the ρλ( ·, μ) we obtain Kullback action or the deviation function, Hλ(π ‖ ν), with respect to an empirical pair measure, π, as the Legendre dual. For the finite typed random graph conditioned to have an empirical link measure π and empirical type measure μ, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 5 شماره
صفحات -
تاریخ انتشار 2016